Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences

نویسندگان

  • Anne Canteaut
  • Pascale Charpin
  • Hans Dobbertin
چکیده

We study [2m−1, 2m]-binary linear codes whose weights lie between w0 and 2m−w0, where w0 takes the highest possible value. Primitive cyclic codes with two zeros whose dual satisfies this property actually correspond to almost bent power functions and to pairs of maximum-length sequences with preferred crosscorrelation. We prove that, for odd m, these codes are completely characterized by their dual distance and by their weight divisibility. Using McEliece’s theorem we give some general results on the weight divisibility of duals of cyclic codes with two zeros; specifically, we exhibit some infinite families of pairs of maximum-length sequences which are not preferred.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions

Based on a sufficient condition proposed by Hollmann and Xiang forconstructing triple-error-correcting codes, the minimum distance of a binary cycliccodeC1,3,13 with three zeros α, α3, and α13 of length 2−1 and the weight divisibilityof its dual code are studied, where m ≥ 5 is odd and α is a primitive element of thefinite field F2m . The codeC1,3,13 is proven to hav...

متن کامل

Cryptanalysis of block ciphers and weight divisibility of some binary codes

The resistance of an iterated block cipher to most classical attacks can be quantified by some properties of its round function. The involved parameters (nonlinearity, degrees of the derivatives...) for a function F from F2 into F2 are related to the weight distribution of a binary linear code CF of length 2 − 1 and dimension 2m. In particular, the weight divisibility of CF appears as an import...

متن کامل

Cyclic codes over $\mathbb{F}_{2^m}[u]/\langle u^k\rangle$ of oddly even length

Let F2m be a finite field of characteristic 2 and R = F2m [u]/〈u 〉 = F2m + uF2m + . . . + u k−1 F2m (u k = 0) where k ∈ Z satisfies k ≥ 2. For any odd positive integer n, it is known that cyclic codes over R of length 2n are identified with ideals of the ring R[x]/〈x − 1〉. In this paper, an explicit representation for each cyclic code over R of length 2n is provided and a formula to count the n...

متن کامل

Gold type codes of higher relative dimension

or respectively 2 m−e 2e )d + 1, 2 m−3e 2e )d + 1, · · · , 2 m+3e 2e −k)d + 1. Then s1, · · · , sk−1 are maximum-length binary sequences of length 2 m − 1. Let C be the F2-vector space generated by all circular shifts of s, s1, · · · , sk−1. Then C has an F2m-vector space structure, and is of dimension k over F2m . When k = 2, C is the Gold code. So we regard C as a Gold type code of relative d...

متن کامل

Binary quasi-perfect linear codes from APN quadratic functions

A mapping f from F2m to itself is almost perfect nonlinear (APN) if its directional derivatives in nonzero directions are all 2-to-1. Let Cf be the binary linear code of length 2 − 1, whose parity check matrix has its j-th column [ π f(π) ] , where π is a primitive element in F2m and j = 0, 1, · · · , 2 − 2. For m ≥ 3 and any quadratic APN function f(x) = ∑m−1 i,j=0 ai,jx 2+2 , ai,j ∈ F2m , it ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2000